List-Distinguishing Colorings of Graphs
نویسندگان
چکیده
منابع مشابه
List-Distinguishing Colorings of Graphs
A coloring of the vertices of a graph G is said to be distinguishing provided that no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, denoted D(G), is the minimum number of colors in a distinguishing coloring of G. The distinguishing number, first introduced by Albertson and Collins in 1996, has been widely studied and a number of interesting res...
متن کاملRestricted List Colorings of Graphs
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2–list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a...
متن کاملList total colorings of graphs
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We also show that the total-choosability of a graph of maximum degree 2 is equal to its total chromatic number.
متن کاملOriented list colorings of graphs
A 2-assignment on a graph G = (V; E) is a collection of pairs L(v) of allowed colors speciied for all vertices v 2 V. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satisses the following property : For every 2-assignment there exists a choice c(v) 2 L(v) for all v 2 V such that (i) if c(v) = c(w), then vw = 2 E, and (ii) for ever...
متن کاملGap vertex-distinguishing edge colorings of graphs
In this paper, we study a new coloring parameter of graphs called the gap vertexdistinguishing edge coloring. It consists in an edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is given by the difference between the highest and the lowest colors of its adjacent edges. The minimum number of colors required for a gap vertex-distingu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/648